STRONG ENDOMORPHISMS OF PI -CONNECTED AUTOMATAPARADIS AD; THIERRIN G.1980; SEMIGR. FORUM; DEU; DA. 1980; VOL. 20; NO 1; PP. 91-93; BIBL. 2 REF.Article

HYPERCODES, RIGHT CONVEX LANGUAGES AND THEIR SYNTACTIC MONOIDSTHIERRIN G.1981; PROC. AM. MATH. SOC.; ISSN 0002-9939; USA; DA. 1981; VOL. 83; NO 2; PP. 255-258; BIBL. 10 REF.Article

CONTEXT-FREE AND STATIONARY LANGUAGESTHIERRIN G.1979; INTERNATION. J. COMPUTER MATH.; USA; DA. 1979; VOL. 7; NO 4; PP. 297-301; BIBL. 4 REF.Article

REFLECTIVE STAR LANGUAGES AND CODESREIS CM; THIERRIN G.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 1; PP. 1-9; BIBL. 7 REF.Article

POWER-SEPARATING REGULAR LANGUAGES. = LANGAGES REGULIERS A SEPARATION DE PUISSANCESSHYR HJ; THIERRIN G.1974; MATH. SYST. THEORY; U.S.A.; DA. 1974; VOL. 8; NO 1; PP. 90-95; BIBL. 10 REF.Article

HYPERCODES IN DETERMINISTIC AND SLENDER OL LANGUAGESHEAD T; THIERRIN G.1980; INFORM. CONTROL.; ISSN 0019-9958; USA; DA. 1980; VOL. 45; NO 3; PP. 251-262; BIBL. 17 REF.Article

CODES, LANGUAGES AND MOL SCHEMES.SHYR HJ; THIERRIN G.1977; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 4; PP. 293-301; BIBL. 9 REF.Article

DOL SCHEMES AND THE PERIODICITY OF STRING EMBEDDINGSHEAD T; THIERRIN G; WILKINSON J et al.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 1; PP. 83-89; BIBL. 10 REF.Article

H-BOUNDED AND SEMI-DISCRETE LANGUAGESKUNZE M; SHYR HJ; THIERRIN G et al.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 51; NO 2; PP. 174-187; BIBL. 11 REF.Article

Contextual insertions/deletions and computabilityKARI, L; THIERRIN, G.Information and computation (Print). 1996, Vol 131, Num 1, pp 47-61, issn 0890-5401Article

Congruences, infix and cohesive prefix codesITO, M; THIERRIN, G.Theoretical computer science. 1994, Vol 136, Num 2, pp 471-485, issn 0304-3975Article

The syntactic monoid of an infix codePETRICH, M; THIERRIN, G.Proceedings of the American Mathematical Society. 1990, Vol 109, Num 4, pp 865-873, issn 0002-9939, 9 p.Article

On ω-languages whose syntactic monoid is trivialJURGENSEN, H; THIERRIN, G.International journal of computer & information sciences. 1983, Vol 12, Num 5, pp 359-365, issn 0091-7036Article

F-Disjunctive languagesGUO, Y. Q; SHYR, H. J; THIERRIN, G et al.International journal of computer mathematics. 1986, Vol 18, Num 3-4, pp 219-237, issn 0020-7160Article

Disjunctive decomposition of languagesGUO, Y. Q; XU, G. W; THIERRIN, G et al.Theoretical computer science. 1986, Vol 46, Num 1, pp 47-51, issn 0304-3975Article

Languages whose n-element subsets are codesITO, M; JÜRGENSEN, H; SHYR, H. J et al.Theoretical computer science. 1992, Vol 96, Num 2, pp 325-344, issn 0304-3975Article

Outfix and infix codes and related classes of languagesITO, M; JÜRGENSEN, H; SHYR, H. J et al.Journal of computer and system sciences (Print). 1991, Vol 43, Num 3, pp 484-508, issn 0022-0000Article

Anti-commutative languages and n-codesITO, M; JURGENSEN, H; SHYR, H. J et al.Discrete applied mathematics. 1989, Vol 24, Num 1-3, pp 187-196, issn 0166-218XArticle